Optimal Results in Staged Self-Assembly of Wang Tiles
نویسندگان
چکیده
The subject of self-assembly deals with the spontaneous creation of ordered systems from simple units and is most often applied in the field of nanotechnology. The self-assembly model of Winfree describes the assembly of Wang tiles, simulating assembly in real-world systems. We use an extension of this model, known as the staged self-assembly model introduced by Demaine et al. that allows for discrete steps to be implemented and permits more diverse constructions. Under this model, we resolve the problem of constructing segments, creating a method to produce them optimally. Generalizing this construction to squares gives a new flexible method for their construction. Changing a parameter of the model, we explore much simpler constructions of complex monotone shapes. Finally, we present an optimal method to build most
منابع مشابه
New Geometric Algorithms for Staged Self-Assembly
We consider staged self-assembly, in which squareshaped Wang tiles can be added to bins in several stages. Within these bins the tiles may connect to each other, depending on the glue types of their edges. In general, self-assembly constructs complex (polyomino-shaped) structures from a limited set of square tiles. Previous work by Demaine et al. considered a setting in which assembly proceeds ...
متن کاملNew Geometric Algorithms for Fully Connected Staged Self-Assembly
We consider staged self-assembly systems, in which squareshaped Wang tiles can be added to bins in several stages. Within these bins, the tiles may connect to each other, depending on the glue types of their edges. Previous work by Demaine et al. showed that a relatively small number of tile types suffices to produce arbitrary shapes in this model. However, these constructions were only based o...
متن کاملDNA Tiles, Wang Tiles and Combinators
In this paper we explore the relation between Wang Tiles and Schonfinkel Combinators in order to investigate Functional Combinators as an programming language for Self-assembly and DNA computing. We show: How any combinatorial program can be expressed in terms of Wang Tiles, and again, how any computation of the program fits into a grid of tiles of a suitable finite, tile set, and finally, how ...
متن کاملProgramming Self-Assembly of DNA Tiles
SKI is a Turing complete, language for programming in the aTAM model. A compilation technique provides a mapping from SKI into finite sets of DNA Tiles that self-assemble in the aTAM model. Though such sets are always finite, the number of Tiles may be relevant, the construction of the Tiles may be heavy and the self-assembly can produce wrong molecular growth. In this paper we discuss the cons...
متن کاملSelf-Assembled Circuit Patterns
Self-assembly is a process in which basic units aggregate under attractive forces to form larger compound structures. Recent theoretical work has shown that pseudo-crystalline self-assembly can be algorithmic, in the sense that complex logic can be programmed into the growth process [26]. This theoretical work builds on the theory of twodimensional tilings [8], using rigid square tiles called W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013